Enumerating All Rooted Trees Including k Leaves
نویسندگان
چکیده
منابع مشابه
Enumerating k-Way Trees
This paper makes a contribution to the enumeration of trees. We prove a new result about k-way trees, point out some special cases, use it to give a new proof of Cayley’s enumeration formula for labelled trees, and observe that our techniques allow various types of k-way trees to be generated uniformly at random. We recall the definition: a k-way tree is either empty or it consists of a root no...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملAn Algorithm for Enumerating All Tree Matchings for Ordered Trees
We consider the problem of finding all tree matchings between two input ordered trees. If an ordered tree has internal structured variables as internal nodes, it is said to be a term tree. In this talk, we deal with the enumeration problem for tree matchings between an ordered tree and a term tree. A term tree T1 and an ordered tree T2 are given. Then, we consider the problem for finding all tr...
متن کاملEnumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a rooted graph to have several different representations, called embeddings. We give a general framework to design algorithms for enumerating embeddings of all graphs in H without repetition. The framework yields an efficient...
متن کاملEMBEDDING OF CIRCULANT NETWORKS INTO k-ROOTED SIBLING TREES
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength and dilation of embedding circulant networks into k-rooted sibling trees. AMS Subject Classification: 05C78, 05C85
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.763